Hanabi is NP-hard, even for cheaters who look at their cards
نویسندگان
چکیده
منابع مشابه
Hanabi is NP-complete, Even for Cheaters who Look at Their Cards
This paper studies a cooperative card game called Hanabi from an algorithmic combinatorial game theory viewpoint. The aim of the game is to play cards from 1 to n in increasing order (this has to be done independently in c different colors). Cards are drawn from a deck one by one. Drawn cards are either immediately played, discarded or stored for future use (overall each player can store up to ...
متن کاملChecking Monotonicity is NP-Hard Even for Cubic Polynomials
One of the main problems of interval computations is to compute the range of a given function over given intervals. In general, this problem is computationally intractable (NP-hard) – that is why we usually compute an enclosure and not the exact range. However, there are cases when it is possible to feasibly compute the exact range; one of these cases is when the function is monotonic with resp...
متن کاملTrainyard is NP-hard
Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity. A successful puzzle has to be both captivating and challenging, and it has been suggested that this features are somehow related to their computational complexity [5]. Indeed, many puzzle games – such as Mah-Jongg, Sokoban, Candy Crush, and 2048, to name a few – a...
متن کاملFor Complex Intervals, Exact Range Computation Is NP-Hard Even for Single Use Expressions (Even for the Product)
One of the main problems of interval computations is to compute the range y of the given function f(x1, . . . , xn) under interval uncertainty. Interval computations started with the invention of straightforward interval computations, when we simply replace each elementary arithmetic operation in the code for f with the corresponding operation from interval arithmetic. In general, this techniqu...
متن کاملThe steady state system problem is NP-hard even for monotone quadratic Boolean dynamical systems
In [2], the authors give a polynomial-time algorithm for deciding for a Boolean dynamical system in which each regulatory function is a monomial whether every limit cycle is a steady state. We show that the corresponding problem is NP-hard if the class of permissible regulatory functions contains the quadratic monotone functions xi ∨ xj and xi∧xj. We also show that the problem is NP-hard if the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.02.024